A survey of special Aronszajn trees
نویسنده
چکیده
The paper reviews special Aronszajn trees, both at ω1 and κ + for an uncountable regular κ. It provides a comprehensive classification of the trees and discusses the existence of these trees under different set-theoretical assumptions. The paper provides details and proofs for many folklore results which circulate (often without a proper proof) in the literature.
منابع مشابه
Specialising Aronszajn Trees and Preserving Some Weak Diamonds
We show that ♦(R,N ,∈) together with CH and “all Aronszajn trees are special” is consistent relative to ZFC. The weak diamond for the covering relation of Lebesgue null sets was the only weak diamond in the Cichoń diagramme for relations whose consistency together with “all Aronszajn trees are special” was not yet settled. Our forcing proof gives also new proofs to the known consistencies of se...
متن کاملStructural Analysis of Aronszajn Trees
In this paper I will survey some recent developments in the combinatorics of Aronszajn trees. I will cover work on coherent and Lipschitz trees, the basis problem for uncountable linear orderings, subtree bases for Aronszajn trees, and the existence of minimal Aronszajn types.
متن کاملSuccessive Failures of Approachability
Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than א1, we produce a model in which the approachability property fails (hence there are no special Aronszajn trees) at all regular cardinals in the interval [א2,אω2+3] and אω2 is strong limit.
متن کاملSouslin trees and successors of singular cardinals
The questions concerning existence of Aronszajn and Souslin trees are of the oldest and most dealt-with in modern set theory. There are many results about existence of h+-Aronszajn trees for regular cardinals A. For these cases the answer is quite complete. (See Jech [6] and Kanamory & Magidor [8] for details.) The situation is quite different when A is a singular cardinal. There are very few r...
متن کاملLadder Systems on Trees
We formulate the notion of uniformization of colorings of ladder systems on subsets of trees. We prove that Suslin trees have this property and also Aronszajn trees in the presence of Martin’s Axiom. As an application we show that if a tree has this property, then every countable discrete family of subsets of the tree can be separated by a family of pairwise disjoint open sets. Such trees are t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015